Variable Neighborhood Search Algorithm to Achieve | Optimal Allocation Design for Known Covariates
نویسندگان
چکیده
منابع مشابه
a benchmarking approach to optimal asset allocation for insurers and pension funds
uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...
15 صفحه اولVariable neighborhood search for minimum cost berth allocation
The berth allocation problem is to allocate space along the quayside to incoming ships at a container terminal in order to minimize some objective function. We consider minimization of total costs for waiting and handling as well as earliness or tardiness of completion, for all ships. We assume ships can arrive at any given time, i.e., before or after the berths become available. The resulting ...
متن کاملa two-phase variable neighborhood search for solving nonlinear optimal control problems
in this paper, a two-phase algorithm, namely ivns, is proposed for solving nonlinear optimal control problems. in each phase of the algorithm, we use a variable neighborhood search (vns), which performs a uniform distribution in the shaking step and the successive quadratic programming, as the local search step. in the first phase, vns starts with a completely random initial solution of control...
متن کاملVariable Neighborhood Search Based Algorithm for University Course Timetabling Problem
In this paper a variable neighborhood search approach as a method for solving combinatory optimization problems is presented. A variable neighborhood search based algorithm for solving the problem concerning the university course timetable design has been developed. This algorithm is used to solve the real problem regarding the university course timetable design. It is compared with other algor...
متن کاملA Variable Neighborhood Search Algorithm for the Leather Nesting Problem
The leather nesting problem is a cutting and packing optimization problem that consists in finding the best layout for a set of irregular pieces within a natural leather hide with an irregular surface and contour. In this paper, we address a real application of this problem related to the production of car seats in the automotive industry. The high quality requirements imposed on these products...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biostatistics and Biometrics Open Access Journal
سال: 2017
ISSN: 2573-2633
DOI: 10.19080/bboaj.2017.04.555627